全文获取类型
收费全文 | 284篇 |
免费 | 107篇 |
国内免费 | 10篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 8篇 |
2020年 | 14篇 |
2019年 | 6篇 |
2018年 | 10篇 |
2017年 | 16篇 |
2016年 | 21篇 |
2015年 | 21篇 |
2014年 | 19篇 |
2013年 | 17篇 |
2012年 | 24篇 |
2011年 | 26篇 |
2010年 | 14篇 |
2009年 | 26篇 |
2008年 | 17篇 |
2007年 | 12篇 |
2006年 | 23篇 |
2005年 | 24篇 |
2004年 | 20篇 |
2003年 | 7篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 13篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有401条查询结果,搜索用时 31 毫秒
141.
This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
142.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
143.
It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015 相似文献
144.
针对不返回起始点、多个待救援点的应急救援路径规划问题,提出了一种应急救援路径规划的改进蚁群算法,设计了一种新的路径构造方法,为蚁群算法求解该类问题打下了基础。为提高收敛性,改进了信息素更新规则,构造了一种与蚁群算法有效结合的局部搜索算法,提高了算法快速寻优的能力。仿真结果表明:改进蚁群算法能够快速找到一条从救援中心到多个待救援点的优化路径,且收敛速度和最短路径较同类算法更优。 相似文献
145.
146.
147.
主元分析法和模糊积分的航空发动机气路状态监测 总被引:1,自引:0,他引:1
航空发动机是一个大系统,由于结构复杂、工作条件恶劣等因素影响,对其进行有效地健康状态监测成为航空领域长期难以解决的关键技术之一。为有效监测航空发动机健康状态,以航空发动机气路系统为例,提出一种基于主元分析和模糊积分的航空发动机状态监测方法。首先,利用主元分析法提取发动机状态样本集的主元,对样本数据进行降维,实现样本的最优压缩。其次,利用BP神经网络和Elman神经网络对发动机状态信息的特征向量进行初步状态监测。最后,利用模糊积分对采用两种神经网络的初步监测结果进行决策层融合,从而有效地实现对航空发动机气路系统的状态监测。通过某型真实航空发动机验证表明,所提出基于主元分析和模糊积分的状态监测方法,能有效提高监测的准确度,满足航空发动机状态监测的实时性要求,具有良好的工程应用价值。 相似文献
148.
马春鹏 《中国人民武装警察部队学院学报》2014,(7):45-48
提升工作效率和促进人生成功是个性心理特征与岗位匹配的逻辑起点,在部队政治工作中实现政治警官个性心理特征与岗位匹配,对于提高政治工作效益有着十分重要的现实意义.更新选用理念,创新测量技术,完善选用制度是实现政治警官个性心理特征与岗位匹配的有效路径. 相似文献
149.
移动汇聚节点调度是传感器网络中一个新的研究热点.通过建立一个普适的多目标优化模型,提出了贴近实际的汇聚节点循环路径规划模型,采用以连续时间离散化为理论基础的时域-空域转化方法,将时域中的优化模型无损地转至空域中,从而大大减少了所涉及的变量数量,降低了求解的复杂度.通过实验可以看出,调度移动汇聚节点可以有效扩展网络的生命周期. 相似文献
150.
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014 相似文献